Landmarks in graphs
نویسندگان
چکیده
منابع مشابه
Distance Landmarks Revisited for Road Graphs
Computing shortest distances is one of the fundamental problems on graphs, and remains a challenging task today. Distance landmarks have been recently studied for shortest distance queries with an auxiliary data structure, referred to as landmark covers. This paper studies how to apply distance landmarks for fast exact shortest distance query answering on large road graphs. However, the direct ...
متن کاملSound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complete, earlier approaches have focused on finding landmarks for the delete relaxation Π. Furthermore, some of these approaches have approximated this set of landmarks, although it has been shown that the complete set of c...
متن کاملEvaluation of Two Facial Nerve Landmarks Frequency in Parotidectomy
This is a Correction to: http://irjns.org/article-1-52-en.html&sw=Evaluation+of+Two+Facial+Nerve+Landmarks+Frequency+in+Parotidectomy
متن کاملOrdered Landmarks in Planning
Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and to use them for guiding search, in the hope of speeding up the planning process. We go beyond the previous approaches by considering ordering constraints not only over the (top-level) goals, but also over the sub-...
متن کاملLandmarks in Hierarchical Planning
In this paper we introduce a novel landmark technique for hierarchical planning. Landmarks are abstract tasks that are mandatory. They have to be performed by any solution plan. Our technique relies on a landmark extraction procedure that pre-processes a given planning problem by systematically analyzing the ways in which relevant abstract tasks can be decomposed. We show how the landmark infor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1996
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00106-2